import time
def sorting(f: list):
    n = len(f) - 1
    for i in range(0, n):
        for j in range(0, n - i):
            if f[j] > f[j + 1]:
                f[j], f[j + 1] = f[j + 1], f[j]
    return f
def ftt(fname: str):
    ft = open(fname)
    txt = ft.readline().split(); 
    ft.close()
    f = list(map(int, txt))
    start = time.time()
    f = sorting(f)
    print(time.time() - start)
ftt("m1_sorted.txt")
ftt("m2_reverse.txt")
ftt("m3_shuffle.txt")